Fixed-Point Computations over Functions on Integers with Operations min, max and plus
نویسندگان
چکیده
Various kinds of graph problems, including shortest path computation, proof-number search, dataflow analysis, etc., can be solved by fixed-point computations over functions defined on natural numbers or integers. In this paper, we prove that fixed-point computations are possible for the algebra Z∞ = Z∪{∞,−∞}, which has the operators min, max and plus. Since Z∞ is not well-ordered, we formulate a kind of acceleration technique to guarantee termination of fixed-point computations.
منابع مشابه
The balance problem of min-max systems is co-NP hard
Min-max systems are timed discrete event dynamic systems containing min, max and plus operations. A min-max system is balanced if it admits a global cycle time (generalized eigenvalue) for every possible assignment of parameters. This paper proves that the testing of the balance property for min-max systems is co-NP hard by showing that the test of inseparability is co-NP hard. The latter resul...
متن کاملTiming Analysis of Digital Circuits and the Theory of Min-Max Functions
asynchronous circuit, clock schedule verification, cycle time, fixed point, max-plus algebra, min-max function Recent progress in the timing analysis of digital circuits has involved the use of maximum and minimum timing constraints. We put forward the theory of min-max functions, a non-linear generalization of max-plus algebra, as the correct framework in which to study problems with mixed con...
متن کاملImplementation of Low-Cost Architecture for Control an Active Front End Rectifier
In AC-DC power conversion, active front end rectifiers offer several advantages over diode rectifiers such as bidirectional power flow capability, sinusoidal input currents and controllable power factor. A digital finite control set model predictive controller based on fixed-point computations of an active front end rectifier with unity displacement of input voltage and current to improve dynam...
متن کاملFixed Point Results on $b$-Metric Space via Picard Sequences and $b$-Simulation Functions
In a recent paper, Khojasteh emph{et al.} [F. Khojasteh, S. Shukla, S. Radenovi'c, A new approach to the study of fixed point theorems via simulation functions, Filomat, 29 (2015), 1189-–1194] presented a new class of simulation functions, say $mathcal{Z}$-contractions, with unifying power over known contractive conditions in the literature. Following this line of research, we extend and ...
متن کاملRational Semimodules over the Max-plus Semiring and Geometric Approach of Discrete Event Systems
We introduce rational semimodules over semirings whose addition is idempotent, like the max-plus semiring. We say that a subsemimodule of the free semimodule Sn over a semiring S is rational if it has a generating family that is a rational subset of Sn, Sn being thought of as a monoid under the entrywise product. We show that for various semirings of max-plus type whose elements are integers, r...
متن کامل